Distributed Construction and Maintenance of Bandwidth-Efficient Bluetooth Scatternets

Bluetooth networks can be constructed as piconets or scatternets depending on the number of nodes in the network. Although piconet construction is a well-defined process specified in Bluetooth standards, scatternet construction policies and algorithms are not well specified. Among many solution proposals for this problem, only a few of them focus on efficient usage of bandwidth in the resulting scatternets. In this paper, we propose a distributed algorithm for the scatternet construction problem, that dynamically constructs and maintains a scatternet based on estimated traffic flow rates between nodes. The algorithm is adaptive to changes and maintains a constructed scatternet for bandwidth-efficiency when nodes come and go or when traffic flow rates change. Based on simulations, the paper also presents the improvements in bandwidth-efficiency provided by the proposed algorithm

Distributed joint flow-radio and channel assignment using partially overlapping channels in multi-radio wireless mesh networks

Equipping mesh nodes with multiple radios that support multiple wireless channels is considered a promising solution to overcome the capacity limitation of single-radio wireless mesh networks. However, careful and intelligent radio resource management is needed to take full advantage of the extra radios on the mesh nodes. Flow-radio assignment and channel assignment procedures should obey the physical constraints imposed by the radios as well as the topological constraints imposed by routing. Varying numbers of wireless channels are available for the channel assignment procedure for different wireless communication standards. To further complicate the problem, the wireless communication standard implemented by the radios of the wireless mesh network may define overlapping as well as orthogonal channels, as in the case of the IEEE 802.11b/g family of standards. This paper presents Distributed Flow-Radio Channel Assignment, a distributed joint flow-radio and channel assignment scheme and the accompanying distributed protocol in the context of multi-channel multi-radio wireless mesh networks. The scheme’s performance is evaluated on small networks for which the optimal flow-radio and channel configuration can be computed, as well as on large random topologies. © 2015, Springer Science+Business Media New York

Routing in delay tolerant networks with periodic connections

In delay tolerant networks (DTNs), the network may not be fully connected at any instant of time, but connections occurring between nodes at different times make the network connected through the entire time continuum. In such a case, traditional routing methods fail to operate because there are no contemporaneous end-to-end paths between sources and destinations. This study examines the routing in DTNs where connections arise in a periodic nature. We analyze various levels of periodicity in order to meet the requirements of different network models. We propose different routing algorithms for different kinds of periodic connections. Our proposed routing methods guarantee the earliest delivery time and minimum hop-count, simultaneously. We evaluate our routing schemes via extensive simulation experiments and compare them to some other popular routing approaches proposed for DTNs. Our evaluations show the feasibility and effectiveness of our schemes as viable routing methods for delay tolerant networks. © 2015, Mergenci and Korpeoglu

Reducing query overhead through route learning in unstructured peer-to-peer network

Cataloged from PDF version of article.In unstructured peer-to-peer networks, such as Gnutella, peers propagate query messages towards the resource holders by flooding them through the network. This is, however, a costly operation since it consumes node and link resources excessively and often unnecessarily. There is no reason, for example, for a peer to receive a query message if the peer has no matching resource or is not on the path to a peer holding a matching resource. In this paper, we present a solution to this problem, which we call Route Learning, aiming to reduce query traffic in unstructured peer-to-peer networks. In Route Learning, peers try to identify the most likely neighbors through which replies can be obtained to submitted queries. in this way, a query is forwarded only to a subset of the neighbors of a peer, or it is dropped if no neighbor, likely to reply, is found. The scheme also has mechanisms to cope with variations in user submitted queries, like changes in the keywords. The scheme can also evaluate the route for a query for which it is not trained. We show through simulation results that when compared to a pure flooding based querying approach, our scheme reduces bandwidth overhead significantly without sacrificing user satisfaction. (C) 2008 Elsevier Ltd. All rights reserved

Utilization-based dynamic scheduling algorithm for wireless mesh networks

Channel access scheduling is one of the key components in the design of multihop wireless mesh networks (WMNs). This paper addresses the allocation/demand mismatch problem observed in oblivious WMN channel access scheduling schemes and proposes Utilization-Based Scheduling (UBS). UBS is a Spatial-TDMA- (STDMA-) based dynamic channel access scheduling scheme designed with the aim of increasing the application-level throughput. In UBS, each node has a weight, which is dynamically adjusted in accordance with the node's slot usage history and packet-queue occupancy. UBS is a fully distributed algorithm, where each node adjusts its own weight and makes pseudorandom transmission attempts using only the locally available information. To demonstrate the performance improvements of the dynamic weight adjustment, the performance of UBS is compared against other channel access scheduling schemes through extensive ns-2 simulations under both uniform and nonuniform traffic patterns. © 2010 Miray Kas et al

Active node determination for correlated data gathering in wireless sensor networks

Cataloged from PDF version of article.In wireless sensor network applications where data gathered by different sensor nodes is correlated, not all sensor nodes need to be active for the wireless sensor network to be functional. Given that the sensor nodes that are selected as active form a connected wireless network, the inactive sensor nodes can be turned off. Allowing some sensor nodes to be active and some sensor nodes inactive interchangably during the lifecycle of the application helps the wireless sensor network to have a longer lifetime. The problem of determining a set of active sensor nodes in a correlated data environment for a fully operational wireless sensor network can be formulated as an instance of the connected correlation-dominating set problem. In this work, our contribution is twofold; we propose an effective and runtime-efficient iterative improvement heuristic to solve the active sensor node determination problem, and a benefit function that aims to minimize the number of active sensor nodes while maximizing the residual energy levels of the selected active sensor nodes. Extensive simulations we performed show that the proposed approach achieves a good performance in terms of both network lifetime and runtime efficiency. © 2012 Elsevier B.V. All rights reserved

A connection management protocol for promoting cooperation in Peer-to-Peer networks

Cataloged from PDF version of article.The existence of a high degree of free riding in Peer-to-Peer (P2P) networks is an important threat that should be addressed while designing P2P protocols. In this paper we propose a connection-based solution that will help to reduce the free riding effects on a P2P network and discourage free riding. Our solution includes a novel P2P connection type and an adaptive connection management protocol that dynamically establishes and adapts a P2P network topology considering the contributions of peers. The aim of the protocol is to bring contributing peers closer to each other on the adapted topology and to push the free riders away from the contributors. In this way contribution is promoted and free riding is discouraged. Unlike some other proposals against free riding, our solution does not require any permanent identification of peers or a security infrastructure for maintaining a global reputation system. It is shown through simulation experiments that there is a significant improvement in performance for contributing peers in a network that applies our protocol. © 2007 Elsevier B.V. All rights reserved

A framework for use of wireless sensor networks in forest fire detection and monitoring

Cataloged from PDF version of article.Forest fires are one of the main causes of environmental degradation nowadays. Current surveillance systems for forest fires lack in supporting real-time monitoring of every point of a region at all times and early detection of fire threats. Solutions using wireless sensor networks, on the other hand, can gather sensory data values, such as temperature and humidity, from all points of a field continuously, day and night, and, provide fresh and accurate data to the fire-fighting center quickly. However, sensor networks face serious obstacles like limited energy resources and high vulnerability to harsh environmental conditions, that have to be considered carefully. In this paper, we propose a comprehensive framework for the use of wireless sensor networks for forest fire detection and monitoring. Our framework includes proposals for the wireless sensor network architecture, sensor deployment scheme, and clustering and communication protocols. The aim of the framework is to detect a fire threat as early as possible and yet consider the energy consumption of the sensor nodes and the environmental conditions that may affect the required activity level of the network. We implemented a simulator to validate and evaluate our proposed framework. Through extensive simulation experiments, we show that our framework can provide fast reaction to forest fires while also consuming energy efficiently. (C) 2012 Elsevier Ltd. All rights reserved

A novel measurement-based approach for modeling and computing interference factors for wireless channels

Cataloged from PDF version of article.Wireless communication technologies divide their available spectrum into pre-defined channels. Some wireless technologies, such as the IEEE 802.11b/g, define their channels in such a way that adjacent channels share the spectrum. When two distinct channels share some part of their spectrum, simultaneous transmissions on these channels cause what is k own as the adjacent channel interference. For problems that consider adjacent channel interference, such as the channel assignment problem for multi-channel wireless mesh networks, we need a model that quantitatively describes adjacent channel interference. The interference factor is a concept defined to quantify the amount of the overlap, hence the interference, between two wireless channels. Analytical and experimental methods have been proposed in the literature to define the interference factors among channels of a wireless technology. In this article, we propose a physical-layer-measurement-based, technology-independent and generic approach that is capable of determining interference factors between the channels of a wireless technology and also between the channels of two different wireless technologies, such as IEEE 802.11 and IEEE 802.15.4. We also report our measurement results for interference factors among 802.11b DSSS channels and between 802.15.4 and 802.11b channels. Our results show that our approach is practical, accurate and generic enough to compute the interference factors of radio channels belonging to various wireless communication technologies. © 2013 Ulucinar et al

Effects of physical channel separation on application flows in a multi-radio multi-hop wireless mesh network: An experimental study on BilMesh testbed

Cataloged from PDF version of article.In this paper, we introduce BilMesh, an indoor 802.11 b/g mesh networking testbed we established, and we report about our performance experiments conducted on multi-hop topologies with single-radio and multi-radio relay nodes. We investigate and report the effects of using multi-radio, multi-channel relay nodes in the mesh networking infrastructure in terms of network and application layer performance metrics. We also study the effects of physical channel separation on achievable end-to-end goodput perceived by the applications in the multi-radio case by varying the channel separation between the radio interfaces of a multi-radio relay node. We have observed that the difference between TCP and UDP goodput performances together with the delay and jitter performance depends on the hop count. We also observed that assigning overlapping channels with a central frequency separation of 5-15 MHz may render the CSMA mechanism used in 802.11 MAC ineffective and hence reduce the overall network performance. Finally, we provide some suggestions that can be considered while designing related protocols and algorithms to deal with the observed facts. (C) 2013 Elsevier Ltd. All rights reserved